Some variants of the graph removal lemma
Fan Wei (Princeton University)
Abstract: Among the numerous applications of the regularity lemma, a classical one is the graph removal lemma. It has applications in fields such as number theory and theoretical computer science. For every fixed graph H, the H-removal lemma gives a highly nontrivial equivalence between the density of H in G and the L1 distance between a graph G to the set of H-free graphs. Whether the huge bound in the quantitative estimate is necessary remains a big open question in graph theory. In this talk, I will discuss some recent works on a strengthening of the usual graph removal lemma. This talk is based on some joint work with Jacob Fox.
combinatorics
Audience: researchers in the topic
Comments: password 121323
Series comments: Check scmscomb.github.io/ for more information